Generalized Hough Transforms with Flexible Templates
نویسنده
چکیده
منابع مشابه
Track Finding with Deformable Templates - The Elastic Arms
A novel algorithm for particle tracking is presented and evaluated. It is based on deformable templates that converge using a deterministic annealing algorithm. These deformable templates are initialized by Hough transforms. The algorithm, which eeectively represents a merger between neuronic decision making and parameter tting, naturally lends itself to parallel execution. Very good performanc...
متن کاملReal-Time Feature Detection Using the Hough Transform
The Hough transform is a well-known pattern recognition technique for finding parametric curves and general shapes in an image. This research demonstrates that it is equally well suited for real-time symbol detection. Both the parametric and generalized Hough transforms produce results of high accuracy and excellent performance in real-time video streams, compared with classical techniques such...
متن کاملDNA Microarray Spot Detection Using Hough Transforms
Genetic fingerprinting using DNA microarrays has shown significant promise in rapidly detecting dangerous microorganisms. Though primarily a genetic and bio-chemical technology, one stage of the detection process records an image of the genetic signature. This image contains a variety of illuminated spots which indicate the type of microorganism by their location and intensity. Analyzing these ...
متن کاملScaling for Multimodal 3D Object Detection
We investigate two methods for scalable 3D object detection. We base our approach on a recently proposed template matching algorithm [5] for detecting 3D objects. First, we demonstrate that it is possible to gain significant increase in runtime performance of the algorithm at almost no cost in accuracy by quickly rejecting most regions of the image with low-resolution templates. Second, we inve...
متن کاملA Shape Recognition Algorithm Robust to Occlusion: Analysis and Performance Comparison
This paper introduces a new approach for recognizing two-dimensional shapes called the SKS algorithm and compares it with three other state-of-art methods in detail. These include the Hu Moments, CSS matching and Shape context. The algorithm uses the philosophy of evidence accumulation similar to generalized Hough transform and is highly parallel in nature. The performance of each algorithm is ...
متن کامل